On data-driven chance constraint learning for mixed-integer optimization problems

نویسندگان

چکیده

When dealing with real-world optimization problems, decision-makers usually face high levels of uncertainty associated partial information, unknown parameters, or complex relationships between these and the problem decision variables. In this work, we develop a novel Chance Constraint Learning (CCL) methodology focus on mixed-integer linear problems which combines ideas from chance constraint learning literature. constraints set probabilistic confidence level for single to be fulfilled, whereas aims model functional relationship variables through predictive models. One main issues when establishing learned arises need further bounds its response variable: fulfillment is directly related accuracy behaviour. sense, CCL makes use linearizable machine models estimate conditional quantiles variables, providing data-driven solution constraints. An open-access software has been developed used by practitioners. Furthermore, benefits have tested in two case studies, proving how robustness added optimal solutions are

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Chance Constraint Approach to Multi Response Optimization Based on a Network Data Envelopment Analysis

In this paper, a novel approach for multi response optimization is presented. In the proposed approach, response variables in treatments combination occur with a certain probability. Moreover, we assume that each treatment has a network style. Because of the probabilistic nature of treatment combination, the proposed approach can compute the efficiency of each treatment under the desirable reli...

متن کامل

On Solving Mixed-Integer Constraint Satisfaction Problems with Unbounded Variables

Many mixed-integer constraint satisfaction problems and global optimization problems contain some variables with unbounded domains. Their solution by branch and bound methods to global optimality poses special challenges as the search region is infinitely extended. Many usually strong bounding methods lose their efficiency or fail altogether when infinite domains are involved. Most implemented ...

متن کامل

Global Optimization of Mixed-Integer Nonlinear Problems

Two novel deterministic global optimization algorithms for nonconvex mixed-integer problems (MINLPs) are proposed, using the advances of the BB algorithm for noncon-vex NLPs Adjiman et al. (1998a). The Special Structure Mixed-Integer BB algorithm (SMIN-BB addresses problems with nonconvexities in the continuous variables and linear and mixed-bilinear participation of the binary variables. The G...

متن کامل

Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory

Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...

متن کامل

a chance constraint approach to multi response optimization based on a network data envelopment analysis

in this paper, a novel approach for multi response optimization is presented. in the proposed approach, response variables in treatments combination occur with a certain probability. moreover, we assume that each treatment has a network style. because of the probabilistic nature of treatment combination, the proposed approach can compute the efficiency of each treatment under the desirable reli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematical Modelling

سال: 2023

ISSN: ['1872-8480', '0307-904X']

DOI: https://doi.org/10.1016/j.apm.2023.04.032